By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 20, Issue 1, pp. 1-208

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Absolute Factorization of Polynomials: A Geometric Approach

Dominique Duval

pp. 1-21

BibTeX  Abstract Full Text:  PDF

Deterministic Sampling–A New Technique for Fast Pattern Matching

Uzi Vishkin

pp. 22-40

BibTeX  Abstract Full Text:  PDF

Amplification of Bounded Depth Monotone Read-Once Boolean Formulae

Qian Ping Gu and Akira Maruoka

pp. 41-55

BibTeX  Abstract Full Text:  PDF

Simple Local Search Problems that are Hard to Solve

Alejandro A. Schäffer

pp. 56-87

BibTeX  Abstract Full Text:  PDF

Improved Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes

Ian Parberry and Peiyuan Yan

pp. 88-99

BibTeX  Abstract Full Text:  PDF

High-Probability Parallel Transitive-Closure Algorithms

Jeffrey D. Ullman and Mihalis Yannakakis

pp. 100-125

BibTeX  Abstract Full Text:  PDF

Complexity of Sentences over Number Rings

Shih Ping Tung

pp. 126-143

BibTeX  Abstract Full Text:  PDF

An Optimal On-Line Algorithm for $K$ Servers on Trees

Marek Chrobak and Lawrence L. Larmore

pp. 144-148

BibTeX  Abstract Full Text:  PDF

The Complexity of the Residual Node Connectedness Reliability Problem

K. Sutner, A. Satyanarayana, and C. Suffel

pp. 149-155

BibTeX  Abstract Full Text:  PDF

More Nearly Optimal Algorithms for Unbounded Searching, Part I: The Finite Case

Edward M. Reingold and Xiaojun Shen

pp. 156-183

BibTeX  Abstract Full Text:  PDF

More Nearly Optimal Algorithms for Unbounded Searching, II:The Transfinite Case

Edward M. Reingold and Xiaojun Shen

pp. 184-208

BibTeX  Abstract Full Text:  PDF